Hamiltonian cycles in hypercubes with faulty edges
نویسندگان
چکیده
0020-0255/$ see front matter 2013 Elsevier Inc. All rights reserved. http://dx.doi.org/10.1016/j.ins.2013.09.012 q This work was supported in part by the National Science Council of Republic of China under contracts NSC 98-2221-E and NSC 101-2221-E-011-038-MY3. ⇑ Corresponding author. Address: Department of Information Management, Shih Hsin University, 1 Lane 17 Section 1, Mu-Cha Rd., Taipei 10607 Tel.: +886 222368225x3366. E-mail address: [email protected] (J.-J. Liu). Jia-Jie Liu a,⇑, Yue-Li Wang b
منابع مشابه
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
In the paper “Fault-free Mutually Independent Hamiltonian Cycles in Hypercubes with Faulty Edges” (J. Comb. Optim. 13:153–162, 2007), the authors claimed that an n-dimensional hypercube can be embedded with (n−1−f )-mutually independent Hamiltonian cycles when f ≤ n−2 faulty edges may occur accidentally. However, there are two mistakes in their proof. In this paper, we give examples to explain ...
متن کاملPrescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Ruskey and Savage asked the following question: Does every matching of Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? J. Fink showed that the question is true for every perfect matching, and solved the Kreweras’ conjecture. In this paper we consider the question in hypercubes with faulty edges. We show that every matching M of at most 2n− 1 edges can be extended to a Hamiltonian cycle of Qn ...
متن کاملOn the mutually independent Hamiltonian cycles in faulty hypercubes
Two ordered Hamiltonian paths in the n-dimensional hypercube Qn are said to be independent if i-th vertices of the paths are distinct for every 1 ≤ i ≤ 2n. Similarly, two s-starting Hamiltonian cycles are independent if i-th vertices of the cycle are distinct for every 2 ≤ i ≤ 2n. A set S of Hamiltonian paths and sstarting Hamiltonian cycles are mutually independent if every two paths or cycles...
متن کاملLong cycles in hypercubes with distant faulty vertices
In this paper, we study long cycles in induced subgraphs of hypercubes obtained by removing a given set of faulty vertices such that every two faults are distant. First, we show that every induced subgraph of Qn with minimum degree n− 1 contains a cycle of length at least 2 − 2f where f is the number of removed vertices. This length is the best possible when all removed vertices are from the sa...
متن کاملHamiltonian cycles and paths with prescribed edges in hypercubes
The n-dimensional hypercube Qn is a graph whose vertex set consists of all binary vectors of length n, two vertices being adjacent whenever the corresponding vectors differ in exactly one coordinate. It is well-known that Qn is hamiltonian for every n ≥ 2 and the research on hamiltonian cycles satisfying certain additional properties has received a considerable attention ([7]). The applications...
متن کاملEdge-bipancyclicity of conditional faulty hypercubes
Xu et al. showed that for any set of faulty edges F of an n-dimensional hypercube Qn with |F | n− 1, each edge of Qn − F lies on a cycle of every even length from 6 to 2n, n 4, provided not all edges in F are incident with the same vertex. In this paper, we find that under similar condition, the number of faulty edges can be much greater and the same result still holds. More precisely, we show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 256 شماره
صفحات -
تاریخ انتشار 2014